Local Chromatic Number and Distinguishing the Strength of Topological Obstructions
نویسنده
چکیده
The local chromatic number of a graph G is the number of colors appearing in the most colorful closed neighborhood of a vertex minimized over all proper colorings of G. We show that two specific topological obstructions that have the same implications for the chromatic number have different implications for the local chromatic number. These two obstructions can be formulated in terms of the homomorphism complex Hom(K2, G) and its suspension, respectively. These investigations follow the line of research initiated by Matoušek and Ziegler who recognized a hierarchy of the different topological expressions that can serve as lower bounds for the chromatic number of a graph. Our results imply that the local chromatic number of 4-chromatic Kneser, Schrijver, Borsuk, and generalized Mycielski graphs is 4, and more generally, that 2r-chromatic versions of these graphs have local chromatic number at least r+2. This lower bound is tight in several cases by results of the first two
منابع مشابه
The distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملComputing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملLocal chromatic number and topological properties of graphs ( Extended abstract )
The local chromatic number of a graph, introduced by Erdős et al. in (4), is the minimum number of colors that must appear in the closed neighborhood of some vertex in any proper coloring of the graph. This talk, based on the papers (14; 15; 16), would like to survey some of our recent results on this parameter. We give a lower bound for the local chromatic number in terms of the lower bound of...
متن کاملLocal chromatic number and topological properties of graphs
The local chromatic number of a graph, introduced by Erdős et al. in [3], is the minimum number of colors that must appear in the closed neighborhood of some vertex in any proper coloring of the graph. This talk, based on the papers [13, 14, 15], would like to survey some of our recent results on this parameter. We give a lower bound for the local chromatic number in terms of the lower bound of...
متن کاملLocal chromatic number and the Borsuk-Ulam Theorem
The local chromatic number of a graph was introduced in [13]. It is in between the chromatic and fractional chromatic numbers. This motivates the study of the local chromatic number of graphs for which these quantities are far apart. Such graphs include Kneser graphs, their vertex color-critical subgraphs, the stable Kneser (or Schrijver) graphs; Mycielski graphs, and their generalizations; and...
متن کامل